Multicenter Wiener indices and their applications

Computing Wiener and hyper–Wiener indices of unitary Cayley graphs

The unitary Cayley graph Xn has vertex set Zn = {0, 1,…, n-1} and vertices u and v are adjacent, if gcd(uv, n) = 1. In [A. Ilić, The energy of unitary Cayley graphs, Linear Algebra Appl. 431 (2009) 1881–1889], the energy of unitary Cayley graphs is computed. In this paper the Wiener and hyperWiener index of Xn is computed.

Four new sums of graphs and their Wiener indices

Relation Between Wiener, Szeged and Detour Indices

In theoretical chemistry, molecular structure descriptors are used to compute properties of chemical compounds. Among them Wiener, Szeged and detour indices play significant roles in anticipating chemical phenomena. In the present paper, we study these topological indices with respect to their difference number.

Ordering Trees with Perfect Matchings by Their Wiener Indices

The Wiener index of a connected graph is the sum of all pairwise distances of vertices of the graph. In this paper, we consider the Wiener indices of trees with perfect matchings, characterizing the eight trees with smallest Wiener indices among all trees of order 2 ( 11) m m with perfect matchings.

Altered Wiener Indices

Recently Nikolić, Trinajstić and Randić put forward a novel modification W(G) of the Wiener number W(G), called modified Wiener index , which definition was generalized later by Gutman and the present authors. Here we study another class of modified indices defined as Wmin,λ(G)=∑(V(G) mG(u,ν) −mG(u,ν) ) and show that some of the important properties of W(G), W(G) and W(G) are also properties of...